Composing Programming Languages by Combining Action-Semantics Modules

نویسندگان

  • Kyung-Goo Doh
  • Peter D. Mosses
چکیده

This article demonstrates a method for composing a programming language by combining action-semantics modules. Each module is defined separately, and then a programming-language module is defined by combining existing modules. This method enables the language designer to gradually develop a language by defining, selecting and combining suitable modules. The resulting modular structure is substantially different from that previously employed in action-semantic descriptions. It also discusses how to resolve the conflicts that may arise when combining modules, and indicates some advantages that action semantics has over other approaches in this respect.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path resolution for recursive modules

The ML module system enables flexible development of large software systems by its support of nested structures, functors and signatures. In spite of this flexibility, however, recursion between modules is prohibited, since dependencies between modules must accord with the order of definitions. As a result of this constraint, programmers may have to consolidate conceptually separate components ...

متن کامل

Design, Semantics and Implementation of the Ptolemy Programming Language: A Language with Quantified Typed Events

Implicit invocation (II) and aspect-oriented (AO) languages provide software designers with related but distinct mechanisms and strategies for decomposing programs into modules and composing modules into systems. II languages have explicitly announced events that run registered observer methods. AO languages have implicitly announced events that run method-like but more powerful advice. A limit...

متن کامل

Formal Reasoning about Modules, Reuse, and Their Correctness Submitted To: International Conference on Formal and Applied Practical Reasoning ? Forschungsbericht Aida{95{10 Formal Reasoning about Modules, Reuse, and Their Correctness ?

We present a formalisation of modules that are correct, and (correctly) reusable in the sense that composition of modules preserves both correctness and reusability. We also introduce a calculus for formally reasoning about the construction of such modules. 1 Introduction Modular programming has been around for a long time, and has more recently evolved into object-oriented programming (e.g. 11...

متن کامل

An Algebraic Approach to Mixins and Modularity

We present an algebraic formalization of the notion of mixin module, i.e. a module where the deenition of some components is deferred. Moreover, we deene a set of basic operators for composing mixin modules, intended to be a kernel language with clean semantics in which to express more complex operators of existing modular languages, including variants of inheritance in object oriented programm...

متن کامل

Operational Semantics for BDI Modules in Multi-agent Programming

This paper proposes an operational semantics for BDI modules that can be incorporated in multi-agent programming languages. The introduced concept of modules facilitates the implementation of agents, agent roles, and agent profiles. Moreover, the introduced concept of modules enables common programming techniques such as encapsulation and information hiding for BDI-based multi-agent programs. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Sci. Comput. Program.

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2001